Mechanized Reasoning About Actions Specified in .4*

نویسنده

  • Sakthi Subramanian
چکیده

In order to prove that a sequence of actions can transform an initial situation of the world to a goal situation when complete knowledge of the world is never available, default rules that serve to complete partial descriptions of the world are usually deemed necessary. This leads to non-monotonic reasoning which has proven to be difficult to formalize. In this paper, we present a mechanized formalization for default reasoning about actions specified in the language .A in the Boyer-Moore logic, a first-order logic. The main idea is to use the Boyer-Moore logic as a meta-language for forrealizing the mapping from partial descriptions of the world to the models of the world usually forrealized by applying default rules to partial descriptions. We formalize this mapping by including partial descriptions of the world as explicit objects in the universe of discourse and define a Lisp interpreter that takes a partial description as an argument and simulates the default behavior of the world by applying the "commonsense law of inertia" to the partial description. We formalize some typical examples and show mechanicalproofs requiring default reasoning about actions. *The work described here was supported in part by NSF Grant MIP-9017499. Introduction In order to prove that a sequence of actions can transform an initial situation of the world to a goal situation when complete knowledge of the world is never available, default rules that serve to complete partial descriptions of the world are usually deemed necessary. This leads to non-monotonic reasoning which has proven to be difficult to formalize. In this paper, we present a mechanized formalization for default reasoning about actions specified in the language .A in the Boyer-Moore logic, a first-order logic. The problem of formalizing default reasoning is usually taken to be the discovery and formal expression of default rules that can extend any partial description of the world to a complete description that formalizes a model of the world. We take a different approach and formalize default reasoning by using the Boyer-Moore logic as a meta-language for describing the mapping from syntactic partial descriptions of the world to the models of the world that are formalized by applying default rules to partial descriptions. We formalize this mapping by including partial descriptions of the world as explicit objects in the universe of discourse and define a Lisp interpreter that takes a partial description as an argument and simulates the default behavior of the world by applying the "commonsense law of inertia" to the partial description. We formalize some typical examples and show mechanical proofs requiring default reasoning about actions. The proofs were done completely automatically by the Boyer-Moore theorem prover.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Introduction to Mechanized Reasoning

Mechanized reasoning uses computers to verify proofs and to help discover new theorems. Computer scientists have applied mechanized reasoning to economic problems but – to date – this work has not yet been properly presented in economics journals. We introduce mechanized reasoning to economists in three ways. First, we introduce mechanized reasoning in general, describing both the techniques an...

متن کامل

An Epistemic Event Calculus for ASP-based Reasoning About Knowledge of the Past, Present and Future

We present a generalisation of the Event Calculus, specified in classical logic and implemented in ASP, that facilitates reasoning about non-binary-valued fluents in domains with non-deterministic, triggered, concurrent, and possibly conflicting actions. We show via a case study how this framework may be used as a basis for a “possible-worlds” style approach to epistemic and causal reasoning in...

متن کامل

Mechanized Verification with Sharing

We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning about sharing and aliasing in pointer-based data structures. Both of these are difficulties for reasoning in separation logic because they rely, fundamentally, on non-separate heaps. We show how sharing can be achieve...

متن کامل

Reasoning about Deterministic Action Sequences with Probabilistic Priors

We present a novel algorithm and a new understanding of reasoning about a sequence of deterministic actions with a probabilistic prior. When the initial state of a dynamic system is unknown, a probability distribution can be still specified over the initial states. Estimating the posterior distribution over states (filtering) after some deterministic actions occurred is a problem relevant to AI...

متن کامل

Reasoning about Actions and Planning in LTL Action Theories

In this paper, we study reasoning about actions and planning with incomplete information in a setting where the dynamic system is specified by adopting Linear Temporal Logic (ltl). Specifically, we study: (i) reasoning about action effects (i.e., projection, historical queries, etc.), in such a setting; (ii) when actions can be legally executed, assuming a non-prescriptive approach, where execu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001